Lock Free Data Structures Using STM in Haskell
نویسندگان
چکیده
This paper explores the feasibility of re-expressing concurrent algorithms with explicit locks in terms of lock free code written using Haskell’s implementation of software transactional memory. Experimental results are presented which show that for multi-processor systems the simpler lock free implementations offer superior performance when compared to their corresponding lock based implementations.
منابع مشابه
unreadTVar: Extending Haskell Software Transactional Memory for Performance
As new trends in computer architecture lead towards shared-memory chip multiprocessors (CMP), the rules for programming these machines are significantly changing. In the search for alternatives to deadlock-prone lock-based concurrency protocols, Software Transactional Memory (STM) extensions to Haskell have provided an easy-to-use lock-free abstraction mechanism for concurrent programming, usin...
متن کاملHaskell Transaktionen in verteilten Systemen
Das Konstrukt der Transaktions-Variablen in Concurrent Haskell erleichtert die Entwicklung von nebenläufigen Anwendungen, indem es Deadlocks verhindert und erlaubt Programmteile einfach zu komponieren. In einer vorherigen Arbeit haben wir bereits eine Haskell-Version als Alternative zur existierenden lowlevel GHC-Bibliothek implementiert, die das optimistische verify-und-commit Konzept durch da...
متن کاملLock-free Serializable Transactions
Software transactional memory (STM) provides access to shared data with transactional properties. Existing STM use linearizability as their correctness criterion, although serializability allows more freedom in reordering the operations of committable transactions. Serializable transactions thus provide for more concurrency than linearizable transactions. Specifically, serializability allows re...
متن کاملRegion-Based Dynamic Separation for STM Haskell
We present a design and implementation of dynamic separation in STM Haskell. Dynamic separation is a recent approach to software transactional memory (STM) that achieves strongly-atomic semantics with performance comparable to that of a weakly-atomic STM. STM Haskell, a lazy-versioning STM library for Haskell, previously supported strongly-atomic semantics via static separation, and we have fou...
متن کاملHardware acceleration for lock-free data structures and software-transactional memory
In this paper, we report on a new CPU-architecture extension proposal, named Advanced Synchronization Facility (ASF), which is geared toward accelerating and easing lock-free programming and software transactional memory (STM). We present an initial performance simulation and usability study of ASF’s application to a lock-free data structure (a singly linked list) and to accelerating a state-of...
متن کامل